Optimal Integer Delay Budgeting on Directed Acyclic Graphs

An excess delay each component of a design can tolerate under a given timing constraint, is referred to as a delay budget. Delay budgeting has been widely exploited to improve the design quality. We present an optimal integer delay budgeting algorithm. Due to numerical instability and discreteness of libraries of components during design optimization flow, integer solution for delay budgeting is essential. We prove that integer budgeting problem a 20-year old open problem in design optimization [8]can be solved optimally in polynomial time. We applied optimal delay budgeting in mapping applications on FPGA platform using pre-optimized cores of FPGA libraries. For each application we go through synthesis and place and route stages in order to obtain accurate results. Our optimal algorithm outperforms ZSA algorithm [4] in terms of area by on average for all applications. In some applications, optimal delay budgeting can speedup runtime of place and route up to times.